The Universal Kolyvagin Recursion Implies the Kolyvagin Recursion
نویسنده
چکیده
Let Uz be the universal norm distribution and M a fixed power of prime p, by using the double complex method employed by Anderson, we study the universal Kolyvagin recursion occurred in the canonical basis in the cohomology group H(Gz ,Uz/MUz). We furthermore show that the universal Kolyvagin recursion implies the Kolyvagin recursion in the theory of Euler systems. One certainly hopes this could lead a new way to find new Euler systems.
منابع مشابه
A Note on Cyclotomic Euler Systems and the Double Complex Method
Let F be a finite real abelian extension of Q. Let M be an odd positive integer. For every squarefree positive integer r the prime factors of which are congruent to 1 modulo M and split completely in F, the corresponding Kolyvagin class κr ∈ F×/F×M satisfies a remarkable and crucial recursion which for each prime number l dividing r determines the order of vanishing of κr at each place of F abo...
متن کاملComputing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group
Kolyvagin has shown how to study the Shafarevich-Tate group of elliptic curves over imaginary quadratic fields via Kolyvagin classes constructed from Heegner points. One way to produce explicit non-trivial elements of the Shafarevich-Tate group is by proving that a locally trivial Kolyvagin class is globally non-trivial, which is difficult in practice. We provide a method for testing whether an...
متن کاملOn the Computation of the Cassels Pairing for Certain Kolyvagin Classes in the Shafarevich-Tate Group
Kolyvagin has shown how to study the Shafarevich-Tate group of elliptic curves over imaginary quadratic fields via Kolyvagin classes constructed from Heegner points. One way to produce explicit non-trivial elements of the Shafarevich-Tate group is by proving that a locally trivial Kolyvagin class is globally non-trivial, which is difficult in practice. We provide a method for testing whether an...
متن کاملIntroduction to Kolyvagin systems
Since their introduction by Kolyvagin in [Ko], Euler systems have been used in several important applications in arithmetic algebraic geometry. For a p-adic Galois module T , Kolyvagin’s machinery is designed to provide an upper bound for the size of a Selmer group associated to the Cartier dual of T . Kolyvagin’s method proceeds in three steps. The first step is to establish an Euler system as...
متن کاملRefined Class Number Formulas and Kolyvagin Systems
We use the theory of Kolyvagin systems to prove (most of) a refined class number formula conjectured by Darmon. We show that for every odd prime p, each side of Darmon’s conjectured formula (indexed by positive integers n) is “almost” a p-adic Kolyvagin system as n varies. Using the fact that the space of Kolyvagin systems is free of rank one over Zp, we show that Darmon’s formula for arbitrary...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002